Search results for "numerical approximation"
showing 10 items of 16 documents
Better numerical approximation by Durrmeyer type operators
2018
The main object of this paper is to construct new Durrmeyer type operators which have better features than the classical one. Some results concerning the rate of convergence and asymptotic formulas of the new operator are given. Finally, the theoretical results are analyzed by numerical examples.
Preattentive and attentive responses to changes in small numerosities of tones in adult humans
2016
The brain hosts a primitive number sense to non-symbolically represent numerosities of objects or events. Small exact numerosities (~4 or less) can be individuated in parallel. In contrast, large numerosities (more than ~4) can only be approximated. However, whether small numerosities can be approximated without their parallel individuation remains unclear. Parallel individuation is suggested to be an attentive process and numerical approximation an automatic process. We, therefore, tested whether small numerosities can be represented preattentively. We recorded adult humans׳ event-related potentials (ERPs) and behavioral responses to 300-ms sequences of six tones (each of either 440 Hz or …
Approximating hidden chaotic attractors via parameter switching.
2018
In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration. In Refs. 1–3, it is proved that the attractors of a chaotic system, considered as the unique numerical …
A new approximation procedure for fractals
2003
AbstractThis paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the “distance” between the “exact fractal” and the “approximate fractal” in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.
Fronts propagating with signal dependent speed in limited diffusion and related Hamilton-Jacobi formulations
2021
We consider a class of limited diffusion equations and explore the formation of diffusion fronts as the result of a combination of diffusive and hyperbolic transport. We analyze a new class of Hamilton-Jacobi equations arising from the convective part of general Fokker-Planck equations ruled by a non-negative diffusion coefficient that depends on the unknown and on the gradient of the unknown. We explore the main features of the solution of the Hamilton-Jacobi equations that contain shocks and propose a suitable numerical scheme that approximates the solution in a consistent way with respect to the solution of the associated Fokker-Planck equation. We analyze three model problems covering d…
Stochastic homogenization: Theory and numerics
2015
In this chapter, we pursue two related goals. First, we derive a theoretical stochastic homogenization result for the stochastic forward problem introduced in the first chapter. The key ingredient to obtain this result is the use of the Feynman-Kac formula for the complete electrode model. The proof is constructive in the sense that it yields a strategy to achieve our second goal, the numerical approximation of the effective conductivity. In contrast to periodic homogenization, which is well understood, numerical homogenization of random media still poses major practical challenges. In order to cope with these challenges, we propose a new numerical method inspired by a highly efficient stoc…
Improved fast Gauss transform for meshfree electromagnetic transients simulations
2019
Abstract In this paper improved fast summations are introduced to enhance a meshfree solver for the evolution of the electromagnetic fields over time. The original method discretizes the time-domain Maxwell’s curl equations via Smoothed Particle Hydrodynamics requiring many summations on the first derivatives of the kernel function and field vectors at each time step. The improved fast Gauss transform is properly adopted picking up the computational cost and the memory requirement at an acceptable level preserving the accuracy of the computation. Numerical simulations in two-dimensional domains are discussed giving evidence of improvements in the computation compared to the standard formula…
Some considerations on the transmissivity of trirefringent metamaterials
2016
Nonlocal effects in metal–dielectric (MD) periodic nanostructures may typically be observed when the plasmonic particles and gaps are on the scale of a few tens of nanometers, enabling under certain conditions (succinctly for epsilon near zero) a collimated beam to split into three refracted signals. We developed a method for precisely evaluating the categorized transmissivity in an air/trirefringent metamaterial interface, which uses a fast one-dimensional Fourier transform and finite element solvers of Maxwell’s equations. In periodic arrays of MD nanofilms, it is proved a tunable transmissivity switch of the multirefracted beams under varying angle of incidence and wavelength, while keep…
Numerical Approximation of Elliptic Variational Problems
2003
This chapter is dedicated to the study of Elliptic Variational Inequalities (EVI). Different forms of such an EVI are considered. The Ritz—Galerkin discretization method is introduced, and methods to approximate the solution of an EVI are presented. The finite dimensional subspaces are built by use of the Finite Element Method. The discretized problems are solved using variants of the Successive OverRelaxation (SOR) method. The algorithms are tested on a typical example. The way to develop computer programs is carefully analysed.
Indirect Methods for Optimal Control Problems
2003
This chapter is dedicated to the numerical approximation of Optimal Control Problems. The algorithms are based on the necessary conditions for optimality which allow us to use a descent method for the minimization of the cost functional.